Optimal and Heuristic Application-Aware Oblivious Routing
نویسندگان
چکیده
منابع مشابه
Optimal Oblivious Routing On D-Dimensional Meshes
In this work we consider deterministic oblivious k-k routing algorithms with buffer size O(k). Our main focus lie is the design of algorithms for dimensional n n meshes, d> 1. For these networks we present asymptotically optimal O(kpnd) step oblivious k-k routing algorithms for all k and d > 1.
متن کاملOptimal oblivious routing under statistical uncertainty
In telecommunication networks, a common measure is the maximum congestion (i.e., utilisation) on edge capacity. As traffic demands are often known with a degree of uncertainty, network management techniques must take into account traffic variability. The oblivious performance of a routing is a measure of how congested the network may get, in the worst case, for one of a set of possible traffic ...
متن کاملOptimal Oblivious Routing in Hole-Free Networks
We study oblivious routing algorithms in which the packet paths are constructed independently of each other. Oblivious algorithms are inherently distributed and they can be designed to efficiently balance the network utilization. We give an oblivious routing algorithm for the class of hole-free networks, in which the nodes are topologically embedded in simple areas of the plane. Such networks a...
متن کاملApplication-aware DTN Routing
Delay-tolerant networking (DTN) enables nodes to communicate by means of asynchronous messaging even though no end-to-end path may exist at any point in time. Messages may be of arbitrary size and the (email-style) store-carry-and-forward operation keeps copies of messages in possibly many nodes for an extended period of time. Suitably designed application protocols avoid frequent interactions ...
متن کاملTraffic-oblivious Energy-aware Routing for Multihop Wireless Networks
Abstract— Energy efficiency is an important issue in multihop wireless networks with energy concerns. Usually it is achieved with accurate knowledge of the traffic pattern and/or the current network information such as load and remaining energy level (in an energy constrained case). However, accurate estimation of the traffic pattern is hard to obtain. Transmission interference and lossy links ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2013
ISSN: 0018-9340
DOI: 10.1109/tc.2011.219